Ordering Strict Partial Orders to Model Behavioral Refinement

Cyclic Ordering Through Partial Orders

The orientation problem for ternary cyclic order relations has been attacked in the literature from combinatorial perspectives, through rotations, and by connection with Petri nets. We propose here a two-fold characterization of orientable cyclic orders in terms of symmetries of partial orders as well as in terms of separating sets (cuts). The results are inspired by properties of non-sequentia...

Multicriteria Ordering and Ranking: Partial Orders, Ambiguities and Applied Issues

The paper deals in a preliminary way with the problem of the selection of a unique fuzzy preference relation from the set of fuzzy preference relations. A direct algorithm of possibilistic clustering is the basis of the method of fuzzy preference relation discriminating. A method of decision-making based on a fuzzy preference relation is described and basic concepts of the heuristic method of p...

Extending Partial Orders to Dense Linear Orders

Strict Isometries of Arbitray Orders

We consider the elementary operator L, acting on the Hilbert-Schmidt Class C2(H), given by L(T ) = ATB, with A and B bounded operators on a separable Hilbert space H. In this paper we establish results relating isometric properties of L with those of the defining symbols A and B. We also show that if A is a strict n−isometry on a Hilbert space H then {I, A∗A, (A∗)2A2, . . . , (A∗)n−1An−1} is a ...

Factorable Congruences and Strict Refinement

We show that universal algebras with factorable congruences such as rings with 1 and semirings with 0 and 1 enjoy some of the properties of universal algebras whose congruence lattices are distributive, such as the strict refinement property and a variant of Jónsson’s lemma. A universal algebra A is said to have factorable congruences if whenever A ∼= B × C and θ is a congruence on A, then θ = ...